A Unified Approach for Design of Lp Polynomial Algorithms
نویسنده
چکیده مقاله:
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help designing new algorithms with polynomial-time iterations for problems in other areas.
منابع مشابه
investigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
A Unified Approach for Uzawa Algorithms
We present a unified approach in analyzing Uzawa iterative algorithms for saddle point problems. We study the classical Uzawa method, the augmented Lagrangian method, and two versions of inexact Uzawa algorithms. The target application is the Stokes system, but other saddle point systems, e.g., arising from mortar methods or Lagrange multipliers methods, can benefit from our study. We prove con...
متن کاملA unified kernel function approach to polynomial interior - point algorithms for the Cartesian P ∗ ( κ ) - SCLCP ∗
Recently, Bai et al. [Bai Y.Q., Ghami M. El, Roos C., 2004. A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM Journal on Optimization, 15(1), 101-128.] provided a unified approach and comprehensive treatment of interior-point methods for linear optimization based on the class of eligible kernel functions. In this paper we generalize t...
متن کاملA unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
In this paper we develop new algorithmic machinery for solving hard problems on graphs of bounded rank-width and on digraphs of bounded bi-rank-width in polynomial (XP, to be precise) time. These include, particularly, graph colouring and chromatic polynomial problems, the Hamiltonian path and c-min-leaf outbranching, the directed cut, and more generally MSOL-partitioning problems on digraphs. ...
متن کاملPolynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices
We show that a modified variant of the interior point method can solve linear programs (LPs) whose coefficients are real numbers from a subring of the algebraic integers. By defining the encoding size of such numbers to be the bit size of the integers that represent them in the subring, we prove the modified algorithm runs in time polynomial in the encoding size of the input coefficients, the d...
متن کاملAlgorithms Sequential & Parallel: A Unified Approach
The best ebooks about Algorithms Sequential Parallel A Unified Approach that you can get for free here by download this Algorithms Sequential Parallel A Unified Approach and save to your desktop. This ebooks is under topic such as algorithms sequential and parallel a unified approach algorithms sequential parallel a unified approach algorithms sequential parallel a unified approach algorithms s...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 7 شماره 3
صفحات 155- 160
تاریخ انتشار 1994-08-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023